Reordering the Reorderable Matrix as an Algorithmic Problem
نویسندگان
چکیده
The Reorderable Matrix is a visualization method for tabular data. This paper deals with the algorithmic problems related to ordering the rows and columns in a Reorderable Matrix. We establish links between ordering the matrix and the well-known and much studied problem of drawing graphs. First, we show that, as in graph drawing, our problem allows different aesthetic criterions which reduce to known NPcomplete problems. Second, we apply and compare two simple heuristics to the problem of reordering the Reorderable Matrix: a two-dimensional sort and a graph drawing algorithm.
منابع مشابه
The Barycenter Heuristic and the Reorderable Matrix
Bertin’s reorderable matrix (Bertin 1981, 1983, 2001) is a simple visualization method for exploring tabular data. The basic idea is to transform a multidimensional data set into a 2D interactive graphic. The graphical presentation of a data set contains rows and columns which can be permuted, allowing different views of the data set. The actual data values are replaced with symbols, say circle...
متن کاملInteraction with the Reorderable Matrix
The Reorderable Matrix is a simple visualization method for quantitative tabular data. This paper examines how first-time users interact with the Reorderable Matrix and how well they perform a simple task of finding correlating attributes. Visualizing a set of data is a common task in various activities such as decision-making or opinion-forming. Typical situations are a person making business-...
متن کاملEffective Sparse Matrix Ordering: Just Around the BEND
When performing sparse matrix factorization, the ordering of matrix rows and columns has a dramatic impact on the factorization time. This paper describes an approach to the reordering problem that produces signiicantly better orderings than previous methods. The algorithm is a hybrid of nested dissection and minimum degree ordering, and combines an assortment of algorithmic techniques.
متن کاملUsing sampled information: is it enough for the sparse matrix-vector product locality optimization?
One of the main factors that affect the performance of the sparse matrix–vector product (SpMV) is the low data reuse caused by the irregular and indirect memory access patterns. Different strategies to deal with this problem such as data reordering techniques have been proposed. The computational cost of these techniques is typically high because they consider all the nonzeros of the sparse mat...
متن کاملOptimizing Sparse Matrix Vector Multiplication on SMPs
We describe optimizations of sparse matrix-vector multiplication on uniprocessors and SMPs. The optimization techniques include register blocking, cache blocking, and matrix reordering. We focus on optimizations that improve performance on SMPs, in particular, matrix reordering implemented using two diierent graph algorithms. We present a performance study of this algorithmic kernel, showing ho...
متن کامل